Hamilton surfaces for the complete even symmetric bipartite graph
نویسندگان
چکیده
منابع مشابه
Hamilton surfaces for the complete even symmetric bipartite graph
A cycle in a graph G is called a hamilton cycle if it contains every vertex of G. A l-factor of a graph G is a subgraph H of G with the same vertex set as G, such that each vertex of H has degree one. Ringel [S] has generalized the idea of a hamilton cycle to two dimensions. He showed that if n is odd the set of squares in the n-dimensional cube Q,, can be partitioned into subsets such that eac...
متن کاملCluttered orderings for the complete bipartite graph
To minimize the access cost in large disk arrays (RAID) Cohen et al. [5–7] introduced (d, f)-cluttered orderings of various set systems, d, f ∈ N. In case of a graph this amounts to an ordering of the edge set such that the number of points contained in any d consecutive edges is bounded by the number f . For the complete graph, Cohen et al. gave some optimal solution for small parameters d [5]...
متن کاملSymmetric configurations for bipartite-graph codes
We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix have at most one unit in the same position. In terms of Design Theory, such a matrix is an incidence matrix of a symmetric configuration. Also, it gives rise to an n-regular bipartite graphs without 4-cycles, which can be used for c...
متن کاملMonotonicity for Complete Graphs and Symmetric Complete Bipartite Graphs
Given a graph G, let fk be the number of forests of cardinality k in G. Then the sequence (fk) has been conjectured to be unimodal for any graph G. In this paper we confirm this conjecture for Kn and Kn,n by showing that the sequence for Kn is strictly increasing (when n ≥ 4) and the sequence for Kn,n is strictly increasing except for the very last term. As a corollary we also confirm the conje...
متن کاملSymmetric Hamilton cycle decompositions of complete multigraphs
Let n ≥ 3 and λ ≥ 1 be integers. Let λKn denote the complete multigraph with edge-multiplicity λ. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of λK2m for all even λ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of λK2m − F for all odd λ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90164-7